全文获取类型
收费全文 | 16613篇 |
免费 | 2562篇 |
国内免费 | 2051篇 |
专业分类
电工技术 | 1139篇 |
技术理论 | 2篇 |
综合类 | 1954篇 |
化学工业 | 482篇 |
金属工艺 | 302篇 |
机械仪表 | 891篇 |
建筑科学 | 1159篇 |
矿业工程 | 648篇 |
能源动力 | 265篇 |
轻工业 | 646篇 |
水利工程 | 422篇 |
石油天然气 | 367篇 |
武器工业 | 219篇 |
无线电 | 2656篇 |
一般工业技术 | 719篇 |
冶金工业 | 238篇 |
原子能技术 | 105篇 |
自动化技术 | 9012篇 |
出版年
2024年 | 71篇 |
2023年 | 255篇 |
2022年 | 474篇 |
2021年 | 479篇 |
2020年 | 611篇 |
2019年 | 453篇 |
2018年 | 439篇 |
2017年 | 499篇 |
2016年 | 598篇 |
2015年 | 708篇 |
2014年 | 1250篇 |
2013年 | 1096篇 |
2012年 | 1491篇 |
2011年 | 1488篇 |
2010年 | 1235篇 |
2009年 | 1288篇 |
2008年 | 1294篇 |
2007年 | 1447篇 |
2006年 | 1164篇 |
2005年 | 1063篇 |
2004年 | 833篇 |
2003年 | 598篇 |
2002年 | 515篇 |
2001年 | 369篇 |
2000年 | 312篇 |
1999年 | 229篇 |
1998年 | 166篇 |
1997年 | 140篇 |
1996年 | 122篇 |
1995年 | 89篇 |
1994年 | 65篇 |
1993年 | 67篇 |
1992年 | 59篇 |
1991年 | 32篇 |
1990年 | 37篇 |
1989年 | 29篇 |
1988年 | 15篇 |
1987年 | 12篇 |
1986年 | 6篇 |
1985年 | 15篇 |
1984年 | 16篇 |
1983年 | 16篇 |
1982年 | 14篇 |
1981年 | 8篇 |
1980年 | 12篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved. 相似文献
2.
带关键字搜索的公钥加密(PEKS)是一种有用的加密原语,它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器,而不影响原始数据的安全性和隐私性。但是,由于缺乏对于数据的加密以及解密能力,PEKS方案不能单独进行使用,必须与标准的公钥加密方案(PKE)相结合。因此,Baek等人在2006年引入了一种新的加密原语,称为结合PKE和PEKS的加密方案(PKE+PEKS),它同时提供了PKE和PEKS的功能。目前,已有文献提出了几种PKE+PEKS方案。然而,他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案,与已有方案相比,该方案在性能上有很大的提升,并且在生成关键字和数据密文时,不需要使用双线性对,极大地降低了计算和存储成本。安全性分析表明,本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明,本分提出的方案更加高效。 相似文献
3.
4.
5.
6.
条件概率关系数据库模型 总被引:1,自引:0,他引:1
现实世界中大量存在着的不确定性信息,关系数据库模型仅视它们为空值,有必要增强其处理这类信息的能力,文章在总结前人工作的基础上推广关系数据库模型,创建有效处理随机型不确定性信息的条件概念关系数据库模型,该模型通过在关系模式中增加一个条件概率测度属性,为每条记录指定适当的条件概率的途径,来表示不确定性信息。文中以对象码为基本工具,创建了条件概率关系结构;以特征函数为基本工具,定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛,灵活,因而该模型能有效克服概率关系模型的许多不足。 相似文献
7.
8.
Education-driven research in CAD 总被引:1,自引:0,他引:1
We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals. 相似文献
9.
张鸿宾 《计算机应用与软件》1994,11(5):15-19,53
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。 相似文献
10.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献